package cn.njupt.tree;

import cn.njupt.printer.BinaryTrees;

public class Test {

    public static void main(String[] args) {
        BST<Integer> tree=new AvlTree<>(new BST.Comparator<Integer>() {
            @Override
            public int compare(Integer e1, Integer e2) {
                return e1-e2;
            }
        });
        int[] arr=new int[]{77,60,30};
        for(int i=0;i<30;i++){
            int random=(int)(Math.random()*100);
            System.out.println("---------------------add"+random);
            tree.add(random);
            BinaryTrees.println(tree);
            System.out.println("-----------------------");
        }
//        tree.inOrderTraversal(tree.root);
    }
}
